Dimensions of Copeland-Erdös Sequences
نویسندگان
چکیده
The base-k Copeland-Erdös sequence given by an infinite set A of positive integers is the infinite sequence CEk(A) formed by concatenating the base-k representations of the elements of A in numerical order. This paper concerns the following four quantities. • The finite-state dimension dimFS(CEk(A)), a finite-state version of classical Hausdorff dimension introduced in 2001. • The finite-state strong dimension DimFS(CEk(A)), a finite-state version of classical packing dimension introduced in 2004. This is a dual of dimFS(CEk(A)) satisfying DimFS(CEk(A)) ≥ dimFS(CEk(A)). • The zeta-dimension Dimζ(A), a kind of discrete fractal dimension discovered many times over the past few decades. • The lower zeta-dimension dimζ(A), a dual of Dimζ(A) satisfying dimζ(A) ≤ Dimζ(A). We prove the following. 1. dimFS(CEk(A)) ≥ dimζ(A). This extends the 1946 proof by Copeland and Erdös that the sequence CEk(PRIMES) is Borel normal. 2. DimFS(CEk(A)) ≥ Dimζ(A). 3. These bounds are tight in the strong sense that these four quantities can have (simultaneously) any four values in [0, 1] satisfying the four above-mentioned inequalities.
منابع مشابه
Note on Normal Decimals
It was proved by Champernowne [2] that the decimal . 1234567891011 . . . is normal, and by Besicovitch [11 that the same holds for the decimal . 1491625 . . . . Copeland and Erdös [3] have proved that if p i, P2 . . . . is any sequence of positive integers such that, for every 0 < 1, the number of p's up to n exceeds nB if n is sufficiently large, then the infinite decimal •p ip 2p 3 . . . is n...
متن کاملAnalytic Erdös-Turán conjectures and Erdös-Fuchs theorem
We consider and study formal power series, that we call supported series, with real coefficients which are either zero or bounded below by some positive constant. The sequences of such coefficients have a lot of similarity with sequences of natural numbers considered in additive number theory. It is this analogy that we pursue, thus establishing many properties and giving equivalent statements ...
متن کاملStapled Sequences and Stapling Coverings of Natural Numbers
A stapled sequence is a set of consecutive positive integers such that no one of them is relatively prime with all of the others. The problem of existence and construction of stapled sequences of length N was extensively studied for over 60 years by Pillai, Evans, Brauer, Harborth, Erdös and others. Sivasankaranarayana, Szekeres and Pillai proved that no stapled sequences exist for any N < 17. ...
متن کاملA combinatorial property and power graphs of semigroups
Research on combinatorial properties of sequences in groups and semigroups originates from Bernhard Neumann’s theorem answering a question of Paul Erdös. For results on related combinatorial properties of sequences in semigroups we refer to the book [3]. In 2000 the authors introduced a new combinatorial property and described all groups satisfying it. The present paper extends this result to a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electronic Colloquium on Computational Complexity (ECCC)
دوره شماره
صفحات -
تاریخ انتشار 2005